Harary Index of Anthracene’s Chemical Graph Using Domination
نویسندگان
چکیده
منابع مشابه
Distance-based Graph Invariants of Trees and the Harary Index
Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...
متن کاملThe connectivity and the Harary index of a graph
The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paperweprovide anupper boundof theHarary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with themaximumHarary index among all graphs with a given number of cut vertices or vertex connectivity or edge connectivity. In ad...
متن کاملOn Harary Matrix, Harary Index and Harary Energy
Recently, a new molecular graph matrix, Harary matrix, was defined in honor of Professor Frank Harary, and new graph invariants (local and global) based on it were also defined and researched, Harary index is one of these invariants. The Harary matrix can be used to derive a variant of the Balaban index, Harary index was also successfully tested in several structure-property relationships, so i...
متن کاملHarary index of product graphs
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, the exact formulae for the Harary indices of tensor product G × Km0,m1,...,mr−1 and the strong product G⊠Km0,m1,...,mr−1 , whereKm0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1, . . . ,mr−1 are obtained. Also upper bounds for th...
متن کاملDOMINATION NUMBER OF TOTAL GRAPH OF MODULE
Let $R$ be a commutative ring and $M$ be an $R$-module with $T(M)$ as subset, the set of torsion elements. The total graph of the module denoted by $T(Gamma(M))$, is the (undirected) graph with all elements of $M$ as vertices, and for distinct elements $n,m in M$, the vertices $n$ and $m$ are adjacent if and only if $n+m in T(M)$. In this paper we study the domination number of $T(Gamma(M))$ a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Webology
سال: 2021
ISSN: 1735-188X,1735-188X
DOI: 10.14704/web/v18si01/web18047